%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEV163^5 : TPTP v6.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n089.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:33:49 EDT 2014

% Result   : Theorem 0.52s
% Output   : Proof 0.52s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEV163^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n089.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 08:17:11 CDT 2014
% % CPUTime  : 0.52 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x1fd13f8>, <kernel.Type object at 0x1fd1098>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula (forall (Xp:((a->(a->a))->a)), ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp))) of role conjecture named cTHM187_pme
% Conjecture to prove = (forall (Xp:((a->(a->a))->a)), ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['(forall (Xp:((a->(a->a))->a)), ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp)))']
% Parameter a:Type.
% Trying to prove (forall (Xp:((a->(a->a))->a)), ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp)))
% Found eq_sym000:=(eq_sym00 (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))):((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp))
% Found (eq_sym00 (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) as proof of ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp))
% Found ((eq_sym0 Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) as proof of ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp))
% Found (((eq_sym ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) as proof of ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp))
% Found (fun (Xp:((a->(a->a))->a))=> (((eq_sym ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))) as proof of ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp))
% Found (fun (Xp:((a->(a->a))->a))=> (((eq_sym ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))) as proof of (forall (Xp:((a->(a->a))->a)), ((((eq ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy)))))->(((eq ((a->(a->a))->a)) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))) Xp)))
% Got proof (fun (Xp:((a->(a->a))->a))=> (((eq_sym ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))))
% Time elapsed = 0.209039s
% node=5 cost=-285.000000 depth=4
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (Xp:((a->(a->a))->a))=> (((eq_sym ((a->(a->a))->a)) Xp) (fun (Xg:(a->(a->a)))=> ((Xg (Xp (fun (Xx:a) (Xy:a)=> Xx))) (Xp (fun (Xx:a) (Xy:a)=> Xy))))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------